Nonperiodic preventive maintenance for repairable systems

As a complex system with multiple components usually deteriorates with age, preventive maintenance (PM) is often performed to keep the system functioning in a good state to prolong its effective age. In this study, a nonhomogeneous Poisson process with a power law failure intensity is used to describe the deterioration of a repairable system, and the optimal nonperiodic PM schedule can be determined to minimize the expected total cost per unit time. However, since the determination of such optimal PM policies may involve numerous uncertainties, which typically make the analyses difficult to perform because of the scarcity of data, a Bayesian decision model, which utilizes all available information effectively, is also proposed for determining the optimal PM strategies. A numerical example with a real failure data set is used to illustrate the effectiveness of the proposed approach. The results show that the optimal schedules derived by Bayesian approach are relatively more conservative than that for non‐Bayesian approach because of the uncertainty of the intensity function, and if the intensity function are updated using the collected data set, which indicates more severe deterioration than the prior belief, replacing the entire system instead of frequent PM activities before serious deterioration is suggested. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Dynamic server assignment policies for assembly‐type queues with flexible servers

We seek dynamic server assignment policies in finite‐capacity queueing systems with flexible and collaborative servers, which involve an assembly and/or a disassembly operation. The objective is to maximize the steady‐state throughput. We completely characterize the optimal policy for a Markovian system with two servers, two feeder stations, and instantaneous assembly and disassembly operations. This optimal policy allocates one server per station unless one of the stations is blocked, in which case both servers work at the unblocked station. For Markovian systems with three stations and instantaneous assembly and/or disassembly operations, we consider similar policies that move a server away from his/her “primary” station only when that station is blocked or starving. We determine the optimal assignment of each server whose primary station is blocked or starving in systems with three stations and zero buffers, by formulating the problem as a Markov decision process. Using this optimal assignment, we develop heuristic policies for systems with three or more stations and positive buffers, and show by means of a numerical study that these policies provide near‐optimal throughput. Furthermore, our numerical study shows that these policies developed for assembly‐type systems also work well in tandem systems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

A dual criteria sequencing problem with earliness and tardiness penalties

We consider the problem of sequencing n jobs on a single machine, with each job having a processing time and a common due date. The common due date is assumed to be so large that all jobs can complete by the due date. It is known that there is an O(n log n)‐time algorithm for finding a schedule with minimum total earliness and tardiness. In this article, we consider finding a schedule with dual criteria. The primary goal is to minimize the total earliness and tardiness. The secondary goals are to minimize: (1) the maximum earliness and tardiness; (2) the sum of the maximum of the squares of earliness and tardiness; (3) the sum of the squares of earliness and tardiness. For the first two criteria, we show that the problems are NP‐hard and we give a fully polynomial time approximation scheme for both of them. For the last two criteria, we show that the ratio of the worst schedule versus the best schedule is no more than . © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 422–431, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10020     

多波束时域滑窗空时自适应方法及其性能分析

鉴于新一代机载预警相控阵雷达采用多波束且电子波束灵活可控的特点, 本文提出了一种多波束时域滑窗空时自适应处理方法。理论分析与计算机仿真实验表明, 该方法与现有的几种典型空时二维自适应信号处理 （ Ｓ Ｔ Ａ Ｐ） 方法相比, 具有系统自由度低、低速目标检测性能好、鲁棒性强等优点, 并且实现复杂度较低, 便于工程实现。     

用于无线ATM的协议及方法分析

ＷＡＴＭ 被认为是下一代个人通信网络的解决方案,或是Ｂ－ＩＳＤＮ 网络的无线延伸。目前无线ＡＴＭ 仍处于发展初期,ＡＴＭ 论坛和ＩＴＵ－Ｔ 都未制定正式标准,研究人员正在建立实验性的Ｗ ＡＴＭ 网络,并在其上面实验各种不同的协议。ＡＴＭ 类的无线网络将在未来的宽带通信网中扮演一个重要的角色     

关于雷达角跟踪性能测试方法的探讨

基于雷达跟踪目标最大角速度和角加速度的定义,分析了用雷达跟踪目标最大角速度和角加速度表征雷达跟踪性能的可行性,并对角误差信号的模拟方法进行了讨论。介绍了一个可以测试幅频特性、暂态特性、雷达跟踪目标最大角速度和角加速度的测试系统设计思想。     

双谱特征在水下目标自动识别中的应用

非高斯信号处理是信号处理的一个新领域。以舰船辐射噪声为主的噪声具有很强的非高斯性和非线性性。由此可利用信号双谱,提取舰船辐射噪声信号的非高斯成份。实验结果表明,高阶谱在声纳目标识别方面具有很大的发展潜力     

Constrained minimax optimization of continuous search efforts for the detection of a stationary target

Analytical resolution of search theory problems, as formalized by B.O. Koopman, may be applied with some model extension to various resource management issues. However, a fundamental prerequisite is the knowledge of the prior target density. Though this assumption has the definite advantage of simplicity, its drawback is clearly that target reactivity is not taken into account. As a preliminary step towards reactive target study stands the problem of resource planning under a min–max game context. This paper is related to Nakai's work about the game planning of resources for the detection of a stationary target. However, this initial problem is extended by adding new and more general constraints, allowing a more realistic modeling of the target and searcher behaviors. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Production to order and off‐line inspection when the production process is partially observable

This study combines inspection and lot‐sizing decisions. The issue is whether to INSPECT another unit or PRODUCE a new lot. A unit produced is either conforming or defective. Demand need to be satisfied in full, by conforming units only. The production process may switch from a “good” state to a “bad” state, at constant rate. The proportion of conforming units in the good state is higher than in the bad state. The true state is unobservable and can only be inferred from the quality of units inspected. We thus update, after each inspection, the probability that the unit, next candidate for inspection, was produced while the production process was in the good state. That “good‐state‐probability” is the basis for our decision to INSPECT or PRODUCE. We prove that the optimal policy has a simple form: INSPECT only if the good‐state‐probability exceeds a control limit. We provide a methodology to calculate the optimal lot size and the expected costs associated with INSPECT and PRODUCE. Surprisingly, we find that the control limit, as a function of the demand (and other problem parameters) is not necessarily monotone. Also, counter to intuition, it is possible that the optimal action is PRODUCE, after revealing a conforming unit. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

名将陈光的一生(上)

1955年9月,中国人民解放军第一次授衔时,共有1050位军队高级干部被授予从少将到元帅的军衔.还有不少战功卓著的军队干部由于已经逝世而没有赶上这一盛典,如黄公略、董振堂、赵博生、左权、彭雪枫等先后战死沙场,罗炳辉因积劳成疾而病故,叶挺遭遇了空难,名将陈光也是这一行列中的一员,但情况较特殊.